Computational number theory - PDFSEARCH.IO - Document Search Engine

Computational number theory
Results: 224

#	Item
171	The Power of Quantum Computation Ashley Montanaro Department of Computer Science, University of Bristol 8 May 2014 Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-05-08 10:04:21 Integer factorization algorithms Computational complexity theory Quantum information science Integer factorization Quantum algorithm Quantum computer Prime number General number field sieve RSA Theoretical computer science Applied mathematics Cryptography
172	POLYNOMIAL HIERARCHY, BETTI NUMBERS AND A REAL ANALOGUE OF TODA’S THEOREM SAUGATA BASU AND THIERRY ZELL 1. Brief Description Toda proved in 1989 that the (discrete) polynomial time hierarchy, PH, is contained in the cl Add to Reading List Source URL: www.math.purdue.edu Language: English - Date: 2010-06-16 13:35:58 Field theory Algebraic geometry Polynomial Field extension Field Computational complexity theory Betti number Finite field Number Abstract algebra Mathematics Algebra
173	Element Distinctness, Frequency Moments, and Sliding Windows Rapha¨el Clifford University of Bristol, UK arXiv:[removed] Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 07:07:19 Element distinctness problem Ordinal number Computational complexity theory Probability theory Analysis of algorithms Conjectures Theoretical computer science Applied mathematics SL
174	Extended gcd and Hermite normal form algorithms via lattice basis reduction George Havas School of Information Technology The University of Queensland Queensland 4072, Australia Add to Reading List Source URL: www.numbertheory.org Language: English - Date: 2002-01-22 06:23:32 Algebra Abstract algebra Lie groups Euclidean algorithm Lenstra–Lenstra–Lovász lattice basis reduction algorithm Lattice reduction Lattice Hungarian algorithm Mathematics Computational number theory Lattice points
175	(Joint work with G. Havas and B. Majewski – appeared in Experimental Mathematics) CENTRAL PROBLEM: If d1, . . . , dm, m ≥ 2, are nonzero integers, find integers x1, . . . , xm such that d = gcd(d1, . . . , dm) = x1d1 Add to Reading List Source URL: www.numbertheory.org Language: English - Date: 2011-09-25 12:54:28 Lattice points Abstract algebra Euclidean algorithm Lenstra–Lenstra–Lovász lattice basis reduction algorithm Linear algebra Lattice Mathematics Algebra Computational number theory
176	DMVSaminar Band21 Computational Algebraic Number Theory Add to Reading List Source URL: www.plouffe.fr Language: English - Date: 2014-05-28 20:52:54 Algebraic number theory Field theory Algebraic structures Group theory Number theory Polynomial General number field sieve Algebraic number field Ideal class group Abstract algebra Mathematics Algebra
177	Bulletin for PDF[removed]:18 AM Add to Reading List Source URL: www.storage.jak-stik.ac.id Language: English - Date: 2000-06-07 13:00:00 Quadratic sieve Key size RSA General number field sieve Computational complexity theory TWINKLE Parallel computing Key RSA numbers Cryptography Integer factorization algorithms Key management
178	PDF Document Add to Reading List Source URL: www.plouffe.fr Language: English - Date: 2014-05-28 20:50:36 Pseudorandom number generators Cryptography Computational complexity theory Pseudorandom generator theorem Pseudorandomness Itō diffusion Mathematics Mathematical analysis Polynomials
179	How Fast Can We Multiply Over GF(2)[x]? Paul Zimmermann INRIA Lorraine/LORIA, Nancy, France (thanks to Richard Brent, Pierrick Gaudry, Samuli Larvala, Emmanuel Thom´e) Add to Reading List Source URL: www.loria.fr Language: English - Date: 2007-05-11 02:07:07 Mathematics Academia Richard P. Brent FO Computational number theory
180	DAVID S. JOHNSON Address: 523 Computer Science Building Mail Code 0401 Department of Computer Science Add to Reading List Source URL: davidsjohnson.net Language: English - Date: 2014-01-22 11:11:57 Complexity classes Bin packing problem NP-complete ACM SIGACT Crossing number Linear programming Randomized algorithm Edward G. Coffman Jr. Computers and Intractability: A Guide to the Theory of NP-Completeness Theoretical computer science Applied mathematics Computational complexity theory

UPDATE